Traffic Control Problems using Graph Connectivity
نویسندگان
چکیده
منابع مشابه
Traffic Control Problems using Graph Connectivity
In modern day automobile traffic the problem of traffic congestion calls for the design of efficient control strategies. In this paper it is argued that in order to have efficient and systematic solutions to a traffic control problem at an intersection, graph theoretic models of the problem are quite appropriate for its exploitation. Connectivity of compatibility graph of a traffic intersection...
متن کاملGraph Algorithms for Network Connectivity Problems
This paper surveys the recent progress on the graph algorithms for solving network connectivity problems such as the extreme set problem, the cactus representation problem, the edge-connectivity augmentation problem and the source location problem. In particular, we show that efficient algorithms for these problems can be designed based on maximum adjacency orderings.
متن کاملIdentification of mild cognitive impairment disease using brain functional connectivity and graph analysis in fMRI data
Background: Early diagnosis of patients in the early stages of Alzheimer's, known as mild cognitive impairment, is of great importance in the treatment of this disease. If a patient can be diagnosed at this stage, it is possible to treat or delay Alzheimer's disease. Resting-state functional magnetic resonance imaging (fMRI) is very common in the process of diagnosing Alzheimer's disease. In th...
متن کاملComplexity of Rainbow Vertex Connectivity Problems for Restricted Graph Classes
A path in a vertex-colored graph G is vertex rainbow if all of its internal vertices have a distinct color. The graph G is said to be rainbow vertex connected if there is a vertex rainbow path between every pair of its vertices. Similarly, the graph G is strongly rainbow vertex connected if there is a shortest path which is vertex rainbow between every pair of its vertices. We consider the comp...
متن کاملPregel Algorithms for Graph Connectivity Problems with Performance Guarantees
Graphs in real life applications are often huge, such as the Web graph and various social networks. These massive graphs are often stored and processed in distributed sites. In this paper, we study graph algorithms that adopt Google’s Pregel, an iterative vertexcentric framework for graph processing in the Cloud. We first identify a set of desirable properties of an efficient Pregel algorithm, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2014
ISSN: 0975-8887
DOI: 10.5120/15026-3342